Distributed Explicit Bounded LTL Model Checking
نویسندگان
چکیده
منابع مشابه
Simple Bounded LTL Model Checking
We present a new and very simple translation of the bounded model checking problem which is linear both in the size of the formula and the length of the bound. The resulting CNF-formula has a linear number of variables and clauses.
متن کاملDistribution of Explicit-State LTL Model-Checking
We give a brief summary of recent achievements in the Parallel and Distributed Systems Laboratory at the Faculty of Informatics in Brno that are related to the distribution of explicit-state LTL model-checking. Distribution and parallelization of verification algorithms is one of the current key research themes in the laboratory. Model-checking of complex industrial systems requires techniques ...
متن کاملLinear Encodings of Bounded LTL Model Checking
We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). We present several efficient encodings that have size linear in the bound. Furthermore, we show how the encodings can be extended to LTL with past operators (PLTL). The generalised encoding is still of linear size, but cannot detect minimal length counterexamples. By using the virtual unrolling technique mi...
متن کاملIncremental Semantic LTL Bounded Model Checking
Bounded model checking has proven to be an efficient method for finding bugs in system designs. In this paper, we present an incremental semantic translation for Bounded model checking and give an incremental algorithm. We implement this method in NuSMV model checker and report encouraging results. Keywords-bounded model checking; semantic encoding; incremental; NuSMV
متن کاملBounded Model Checking for Past LTL
The introduction of Past Operators enables to produce more natural formulation of a wide class of properties of reactive systems, compared to traditional pure future temporal logics. For this reason, past temporal logics are gaining increasing interest in several application areas, ranging from Requirement Engineering to Formal Verification and Model Checking. We show how SAT-based Bounded Mode...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2003
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80095-7